Status reverse(LNode *L)
{
	LNode *old;
	LNode *new = (LNode *)malloc(sizeof(LNode));
	while(L -> next)
	{
		L -> next -> next = new -> next;
		new -> next = L -> next;
		old = L -> next;
		L = L -> next;
		free(old);
	}
	return OK;
}



